package a09_贪心算法;

/**
 *
 *
 *
 *
 * @author flyduck
 * @since 2025/1/8
 */
public class a06_买卖股票的最佳时机2 {
    public int maxProfit(int[] prices) {
        int result = 0;
        for (int i = 1; i < prices.length; i++) {
            if(prices[i] > prices[i-1]){
                result = result + (prices[i] - prices[i-1]);
            }
        }
        return result;
    }
}
